Divide-to-Conquer: A Kinetic Model for Singlet Oxygen Photosensitization
نویسندگان
چکیده
منابع مشابه
A Divide-and-Conquer Strategy for Regular Model Checking
Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, ...
متن کاملA Divide and Conquer Approach to Sequencing
We suggest an approach to sequencing based on a \divide and conquer method". This approach eliminates the need for solving a hard NP-complete problem which arises when using traditional sequencing techniques. At the present time this algorithm has not been tried out in the lab. However, computer simulations using parts of the human genome provide some encouraging data.
متن کاملA Divide-and-Conquer Strategy for Parsing
In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disam-biguates the roles of the link words in the sentence and segments the sentence based...
متن کاملDivide and Conquer
An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...
متن کاملDivide and (Iteratively) Conquer!
The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Theory and Computation
سال: 2017
ISSN: 1549-9618,1549-9626
DOI: 10.1021/acs.jctc.7b00619